NP-hard problems - PDFSEARCH.IO - Document Search Engine

NP-hard problems
Results: 67

#	Item
41	Multivariate Algorithmics for NP-Hard String Problems Laurent Bulteau∗ Falk Hüffner† Christian Komusiewicz Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-01-11 10:59:55 NP-complete problems Complexity classes Analysis of algorithms String Closest string Parameterized complexity Kernelization Time complexity Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
42	Bandwidth Approximation of a Restricted Family of Trees Abstract Bandwidth is one of the canonical NP-complete problemsIt is NP-hard to approximate within any constant, even on treesGupta gave a randomized Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2009-12-02 23:05:21 NP-complete problems Tree Clique Path decomposition Graph coloring Graph theory Theoretical computer science Mathematics
43	Bandwidth Approximation of Many-Caterpillars Yuval Filmus September 1, 2009 Abstract Bandwidth is one of the canonical NPcomplete problems. It is NP-hard to approximate Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2009-12-02 23:07:07 Lepidoptera Polynomials Tree decomposition Approximation algorithm Caterpillar Polylogarithmic Theoretical computer science Graph theory Mathematics
44	Chapter 5: Hard Problems Quotation Algorithmic Adventures From Knowledge to Magic Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-10-24 15:11:43 Complexity classes Dynamic programming NP-complete problems Operations research P versus NP problem Time complexity Knapsack problem P Subset sum problem Theoretical computer science Computational complexity theory Applied mathematics
45	COMS21103 NP-completeness (or how to prove that problems are probably hard) Ashley Montanaro Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:08 Complexity classes Analysis of algorithms Mathematical optimization Time complexity Algorithm P NP-complete P versus NP problem Quantum algorithm Theoretical computer science Computational complexity theory Applied mathematics
46	Some hard graph problems in telecoms Keith Briggs Add to Reading List Source URL: keithbriggs.info Language: English - Date: 2006-10-27 09:09:17 NP-complete problems Graph coloring Graph operations Clique Independent set Graph Graph bandwidth Graph theory Theoretical computer science Mathematics
47	HARD SUDOKU PUZZLES 9 1 Add to Reading List Source URL: www.puzzlexpress.com Language: English - Date: 2005-11-16 13:40:25 Recreational mathematics Games Puzzle video games Sudoku Puzzle Mathematical puzzle Sudoku algorithms Mathematics of Sudoku Mathematics Logic puzzles NP-complete problems
48	CS 330 – Spring 2013, Assignment 6 Problems due in the drop-box by 5PM, Thursday, April 18th (Monday schedule that day) Late assignments will only be accepted up until 5PM on Friday, April 19th Question[removed]pts). Cha Add to Reading List Source URL: www.cs.bu.edu Language: English - Date: 2013-04-05 16:53:19 Applied mathematics NP-complete NP P P versus NP problem NP-hard Theoretical computer science Computational complexity theory Complexity classes
49	Journal of Artificial Intelligence Research[removed]Submitted 11/10; published[removed]Where Are the Hard Manipulation Problems? Toby Walsh Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2011-09-28 21:59:58 Voting Social choice theory Single winner electoral systems Mathematical optimization NP-hard NP-complete NP Computational complexity theory Instant-runoff voting Complexity classes Single Transferable Vote Political philosophy
50	Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices - Not for Publication Add to Reading List Source URL: www.econ.brown.edu Language: English - Date: 2013-06-19 07:39:31 Complexity classes NP-complete problems Mathematical optimization Structural complexity theory NP-complete NP-hard P versus NP problem NP Vertex cover Theoretical computer science Computational complexity theory Applied mathematics

UPDATE